An alternating preconditioner for saddle point problems
نویسندگان
چکیده
منابع مشابه
A BDDC Preconditioner for Saddle Point Problems
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...
متن کاملA Preconditioner for Generalized Saddle Point Problems
In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditioned matrix are established. The potential of this approach is illustrated by numerical experiments with matrices fro...
متن کاملAn Implicit Approximate Inverse Preconditioner for Saddle Point Problems
We present a preconditioner for saddle point problems which is based on an approximation of an implicit representation of the inverse of the saddle point matrix. Whereas this preconditioner does not require an approximation to the Schur complement, its theoretical analysis yields some interesting relationship to some Schurcomplement-based preconditioners. Whereas the evaluation of this new prec...
متن کاملThe Bramble-Pasciak preconditioner for saddle point problems
The Bramble-Pasciak Conjugate Gradient method is a well known tool to solve linear systems in saddle point form. A drawback of this method in order to ensure applicability of Conjugate Gradients is the need for scaling the preconditioner which typically involves the solution of an eigenvalue problem. Here, we introduce a modified preconditioner and inner product which without scaling enable the...
متن کاملOn the generalized shift-splitting preconditioner for saddle point problems
In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted form a stationary iterative method which is unconditionally convergent. Moreover, a relaxed version of the proposed preconditioner is presented and some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2010
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.05.003